Patterns on numerical semigroups
نویسندگان
چکیده
We introduce the notion of pattern for numerical semigroups, which allows us to generalize the definition of Arf numerical semigroups. In this way infinitely many other classes of numerical semigroups are defined giving a classification of the whole set of numerical semigroups. In particular, all semigroups can be arranged in an infinite non-stabilizing ascending chain whose first step consists just of the trivial semigroup and whose second step is the well-known class of Arf semigroups. We describe a procedure to compute the closure of a numerical semigroup with respect to a pattern. By using the concept of system of generators associated to a pattern, we construct recursively a directed acyclic graph with all the semigroups admitting the pattern. © 2005 Elsevier Inc. All rights reserved. AMS classification: 20M14
منابع مشابه
Nonhomogeneous patterns on numerical semigroups
Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers belonging to the semigroup. In a first approach, only homogeneous patterns where analized. In this contribution we study conditions for an eventually non-homoge...
متن کاملNumerical semigroups from open intervals
Consider an interval I ⊆ Q . Set S(I) = {m ∈ N : ∃ n ∈ N , mn ∈ I}. This turns out to be a numerical semigroup, and has been the subject of considerable recent investigation (see Chapter 4 of [2] for an introduction). Special cases include modular numerical semigroups (see [4]) where I = [mn , m n−1 ] (m,n ∈ N ), proportionally modular numerical semigroups (see [3]) where I = [mn , m n−s ] (m,n...
متن کاملChomp on numerical semigroups
We consider the two-player game chomp on posets associated to numerical semigroups and show that the analysis of strategies for chomp is strongly related to classical properties of semigroups. We characterize which player has a winning-strategy for symmetric semigroups, semigroups of maximal embedding dimension and several families of numerical semigroups generated by arithmetic sequences. Furt...
متن کاملNumerical semigroups with maximal embedding dimension
Even though the study and relevance of maximal embedding dimension numerical semigroups arises in a natural way among the other numerical semigroups, they have become specially renowned due to the existing applications to commutative algebra via their associated semigroup ring (see for instance [1, 5, 15, 16, 99, 100]). They are a source of examples of commutative rings with some maximal proper...
متن کاملDenumerants of 3-numerical semigroups
Denumerants of numerical semigroups are known to be difficult to obtain, even with small embedding dimension of the semigroups. In this work we give some results on denumerants of 3-semigroups S = 〈a, b, c〉. The time efficiency of the resulting algorithms range from O(1) to O(c). Closed expressions are obtained under certain conditions.
متن کامل